Inferring textual entailment with a probabilistically sound calculus
نویسنده
چکیده
We introduce a system for textual entailment that is based on a probabilistic model of entailment. The model is defined using a calculus of transformations on dependency trees, which is characterized by the fact that derivations in that calculus preserve the truth only with a certain probability. The calculus is successfully evaluated on the datasets of the PASCAL Challenge on Recognizing Textual Entailment.
منابع مشابه
An Extensible Probabilistic Transformation-based Approach to the Third Recognizing Textual Entailment Challenge
We introduce a system for textual entailment that is based on a probabilistic model of entailment. The model is defined using some calculus of transformations on dependency trees, which is characterized by the fact that derivations in that calculus preserve the truth only with a certain probability. We also describe a possible set of transformations (and with it implicitly a calculus) that was ...
متن کاملSurvey in Textual Entailment
Variability of semantic expression is a fundamental phenomenon of a natural language where same meaning can be expressed by different texts. Natural Language Processing applications like Question Answering, Summarization, Information Retrieval systems etc. often demand a generic framework to capture major semantic inferences in order to deal with the challenges created by this phenomenon. Textu...
متن کاملDifferent Models and Approaches of Textual Entailment Recognition
Variability of semantic expression is a fundamental phenomenon of a natural language where same meaning can be expressed by different texts. The process of inferring a text from another is called textual entailment. Textual Entailment is useful in a wide range of applications, including question answering, summarization, text generation, and machine translation. The recognition of textual entai...
متن کاملA Proof-Based Annotation Platform of Textual Entailment
We introduce a new platform for annotating inferential phenomena in entailment data, buttressed by a formal semantic model and a proof-system that provide immediate verification of the coherency and completeness of the marked annotations. By integrating a web-based user interface, a formal lexicon, a lambda-calculus engine and an off-the-shelf theorem prover, the platform allows human annotator...
متن کاملRecognizing Textual Entailment, QA4MRE, and Machine Reading
Machine Reading remains one of the Grand Challenges of Artificial Intelligence, and also one of the most difficult. Machine Reading requires more than just parsing a text; it requires constructing a coherent internal model of the world which that text is describing, including inferring facts that are implicit in the text. One basic operation required for this is to infer or recognize Textual En...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Natural Language Engineering
دوره 15 شماره
صفحات -
تاریخ انتشار 2009